First-Order Expressibility and Boundedness of Disjunctive Logic Programs
نویسندگان
چکیده
In this paper, the fixed point semantics developed in [Lobo et al., 1992] is generalized to disjunctive logic programs with default negation and over arbitrary structures, and proved to coincide with the stable model semantics. By using the tool of ultraproducts, a preservation theorem, which asserts that a disjunctive logic program without default negation is bounded with respect to the proposed semantics if and only if it has a first-order equivalent, is then obtained. For the disjunctive logic programs with default negation, a sufficient condition assuring the first-order expressibility is also proposed.
منابع مشابه
Stratified Least Fixpoint Logic
Compton, K.J., Stratified least fixpoint logic, Theoretical Computer Science 131 (1994) 95-120. Stratified least jixpoint logic, or SLFP, characterizes the expressibility of stratified logic programs and, in a different formulation, has been used as a logic of imperative programs. These two formulations of SLFP are proved to be equivalent. A complete sequent calculus with one infinitary rule is...
متن کاملMany-Valued First-Order Logics with Probabilistic Semantics
We present n-valued rst-order logics with a purely proba-bilistic semantics. We then introduce a new probabilistic semantics of n-valued rst-order logics that lies between the purely probabilistic semantics and the truth-functional semantics of the n-valued Lukasiewicz logics Ln. Within this semantics, closed formulas of classical rst-order logics that are logically equivalent in the classical ...
متن کاملDisjunctive logic programs with existential quantification in rule heads
We consider disjunctive logic programs without function symbols but with existential quantification in rule heads, under the semantics of general stable models. There are at least two interesting prospects in these programs. The first is that a program can be made more succinct by using existential variables, and the second is on the potential in representing defeasible ontological knowledge by...
متن کاملDisjunctive Logic Programming as
Earlier, we have proposed a logic, called priority logic 16, 18], where a theory consists of a collection of logic programming-like inference rules (without default negation) and a priority constraint among them. We showed that nonmonotonic reasoning in general can be viewed as a reasoning based on selecting monotonic inferences that satisfy the speciied priority constraints. The goal of this p...
متن کاملFrom Database Repair Programs to Consistent Query Answering in Classical Logic (extended abstract)
Consistent answers to a query from an inconsistent database are answers that can be simultaneously retrieved from every possible repair; and repairs are consistent instances that minimally differ from the original instance. Database repairs can be specified as the stable models of a disjunctive logic program. In this paper we show how to use the repair programs to transform the problem of consi...
متن کامل